A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
نویسندگان
چکیده
and Applied Analysis 3 Proof. Since f(x) defined in (2) belongs to the PDGstructured family and by Lemma 2.1 in [16] the Clarke subdifferential of F(x, ρ) at x can be formulated by ∂F (x, ρ) = ∂f (x) + ρ∂G (x) = ∂f (x) + ρ conv { ∇g j (x) | j ∈ J (x) ∪ {0}}
منابع مشابه
Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملA Duality Theory with Zero Duality Gap for Nonlinear Programming
Duality is an important notion for constrained optimization which provides a theoretical foundation for a number of constraint decomposition schemes such as separable programming and for deriving lower bounds in space decomposition algorithms such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex optimization prob...
متن کاملExpectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
I this paper, we consider a class of two-stage stochastic optimization problems arising in the protection of vital arcs in a critical path network. A project is completed after a series of dependent tasks are all finished. We analyze a problem in which task finishing times are uncertain but can be insured a priori to mitigate potential delays. A decision maker must trade off costs incurred in i...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کامل